Matrix-product constructions of digital nets

Constructions of Digital Nets Using Global Function Fields

Matrix-Product Constructions for Hermitian Self-Orthogonal Codes

Self-orthogonal codes have been of interest due to there rich algebraic structures and wide applications. Euclidean self-orthogonal codes have been quite well studied in literature. Here, we have focused on Hermitian self-orthogonal codes. Constructions of such codes have been given based on the well-known matrix-product construction for linear codes. Criterion for the underlying matrix and the...

Constructions for Modeling Product Structure

This paper identifies constructions needed for modeling product structure, shows which ones can be represented in OWL2 and suggests extensions for those that do not have OWL2 representations. A simplified mobile robot specification is formalized as a Knowledge Base (KB) in an extended logic. A KB is constructed from a signature of types (classes), typed properties, and typed variables and opera...

Forbidden Configurations and Product Constructions

A simple matrix is a (0,1)-matrix with no repeated columns. For a (0,1)-matrix F , we define that a (0,1)-matrix A has F as a configuration if there is a submatrix of A which is a row and column permutation of F (trace is the set system version of a configuration). Let |A| denote the number of columns of A. We define forb(m,F ) = max{|A| : A is m-rowed simple matrix and has no configuration F}....

Product constructions for transitive decompositions of graphs

A decomposition of a graph is a partition of the edge set, giving a set of subgraphs. A transitive decomposition is a decomposition which is highly symmetrical, in the sense that the subgraphs are preserved and transitively permuted by a group of automorphisms of the graph. This paper describes some ‘product’ constructions for transitive decompositions of graphs, and shows how these may be used...